Aggregation pheromone metaphor for semi-supervised classification

نویسندگان

  • Anindya Halder
  • Susmita Ghosh
  • Ashish Ghosh
چکیده

8 This article presents a novel ‘self-training’ based semi-supervised classifica9 tion algorithm using the property of aggregation pheromone found in real 10 ants. The proposed method has no assumption regarding the data distribu11 tion and is free from parameters to be set by the user. It can also capture 12 arbitrary shapes of the classes. The proposed algorithm is evaluated with 13 a number of synthetic as well as real life benchmark data sets in terms of 14 accuracy, macro and micro averaged F1 measures. Results are compared 15 with two supervised and three semi-supervised classification techniques and 16 are statistically validated using paired t-test. Experimental results show the 17 potentiality of the proposed algorithm. 18

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ant Based Semi-supervised Classification

Semi-supervised classification methods make use of the large amounts of relatively inexpensive available unlabeled data along with the small amount of labeled data to improve the accuracy of the classification. This article presents a novel ‘self-training’ based semi-supervised classification algorithm using the property of aggregation pheromone found in natural behavior of real ants. The propo...

متن کامل

Semi-Supervised Learning Based Prediction of Musculoskeletal Disorder Risk

This study explores a semi-supervised classification approach using random forest as a base classifier to classify the low-back disorders (LBDs) risk associated with the industrial jobs. Semi-supervised classification approach uses unlabeled data together with the small number of labelled data to create a better classifier. The results obtained by the proposed approach are compared with those o...

متن کامل

Optimal Binary Classifier Aggregation for General Losses

We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-convex losses, extending a recent analysis of the problem for misclassification e...

متن کامل

Minimax Binary Classifier Aggregation with General Losses

We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-convex losses, extending a recent analysis of the problem for misclassification e...

متن کامل

An Enhanced Aggregation Pheromone System for Real-Parameter Optimization in the ACO Metaphor

In previous papers we proposed an algorithm for real parameter optimization called the Aggregation Pheromone System (APS). The APS replaces pheromone trails in traditional ACO with aggregation pheromones. The pheromone update rule is applied in a way similar to that of ACO. In this paper, we proposed an enhanced APS (eAPS), which uses a colony model with units. It allows a stronger exploitation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2013